A novel path delay fault simulator using binary logic

A novel path delay fault simulator for combinational logic circuits which is capable of detecting both robust and nonrobust paths is presented. Particular emphasis has been given for the use of binary logic rather than the multiple-valued logic as used in the existing simulators which contributes to the reduction of the overall complexity of the algorithm. A rule based approach has been developed which identifies all robust and nonrobust paths tested by a two-pattern test <V1,V2>, while backtracing from the POs to PIs in a depth-first manner. Rules are also given to find probable glitches and to determine how they propagate through the circuit, which enables the identification of nonrobust paths. Experimental results on several ISCAS'85 benchmark circuits demonstrate the efficiency of the algorithm

Correlation of the Lowest HMO Transition Energies with the Electronic Absorption Frequencies of Some Organic Dyestufts: s-Cyanines & Merocyanines

951-95

Fault tolerant BeeHive routing in mobile ad-hoc multi-radio network

In this paper, fault tolerance in a multi-radio network is discussed. Fault tolerance is achieved using the BeeHive routing algorithm. The paper discusses faults added to the system as random fluctuations in hardware radio operation. The multi-radio nodes are designed using WiMAX and WiFi Radios that work in conjunction using traffic splitting to transfer data across a multi-hop network. During the operation of this network random faults are introduced by turning off certain radios in nodes. The paper discusses fault tolerance as applied to multi radio nodes that use traffic splitting in the transmission of data. We also propose a method to handle random faults in hardware radios by using traffic splitting and combining it with the BeeHive routing algorithm

Performance analysis of bee-hive routing in multi-radio networks

In recent years, wireless communication technology has reduced the distance between people and has hence become a significant part of our lives. Two such technologies are WiFi(IEEE 802.11) and WiMAX(IEEE 802.16) where the latter is a long range system covering many kilometers, whereas former is a synonym for WLAN providing a coverage of only short ranges. This work describes the implementation of a framework in which a multi-hop, ad-hoc network is deployed with hybrid nodes to enhance network throughput. The data traffic received is split between the WiFi and WiMAX radios on the basis of th e split coefficient value statically. The routing algorithm being implemented in this paper is the be e-hive algorithm. Bee-hive algorithm is a multi-path routing algorithm inspired by the social behavior of swarms of bees. It is dynamic, robust and flexible yet simple algorithm which can prove helpful for optimal

Special Issue on Performance of Supercomputers : Guest Editors′ Introduction

This article does not have an abstract

A method for resource and service discovery in MANETs

The paper presents a novel resource and service discovery mechanism for MANETs using Routing Intelligent Mobile Agents(RIMAs). RIMAs periodically collect routing, resource and service availability information and index the same in appropriate RIMA nodes. Every mobile node is close to atleast one RIMA node. The mobile node running an application in need of a resource or a service dispatches a Discovery agent to its nearest RIMA node. The index available at the RIMA node will guide the Discoverer agent to the resource or service node. Analysis of the method reveals the computational complexity to be of the order of square of number of RIMA nodes. Communication overheads are the product of number of generated agents, agent size and number of hops travelled by an agent. The method has been simulated and tested on MANETs of varying sizes from 50 to 800 nodes. Simulation snapshots and results show the proper working and success of the algorithm

A Method for Resource and Service Discovery in MANETs

The paper presents a novel resource and service discovery mechanism for MANETs using Routing Intelligent Mobile Agents(RIMAs). RIMAs periodically collect routing, resource and service availability information and index the same in appropriate RIMA nodes. Every mobile node is close to atleast one RIMA node. The mobile node running an application in need of a resource or a service dispatches a Discovery agent to its nearest RIMA node. The index available at the RIMA node will guide the Discoverer agent to the resource or service node. Analysis of the method reveals the computational complexity to be of the order of square of number of RIMA nodes. Communication overheads are the product of number of generated agents, agent size and number of hops travelled by an agent. The method has been simulated and tested on MANETs of varying sizes from 50 to 800 nodes. Simulation snapshots and results show the proper working and success of the algorithm

L.: UREA: Uncovered Region Exploration Algorithm for Reorganization of Mobile sensor Nodes to maximize Coverage

ABSTRACT: The positioning of sensors in Wireless Sensor Network WSN affects coverage, communication cost and resource management.In non-deterministic deployment, mobility feature of the mobile ad-hoc network can be best exploited to reposition the sensors so as to achieve the best network coverage. The Uncovered Region Exploration Algorithm (UREA) is one such algorithm proposed in [1] for redeployment of the homogeneous nodes after initial random deployment. In this paper we propose generalization of UREA andput forth, two important application scenarios. First, after final deployment of WSNs, they resume to their assigned tasks. The power of some over-utilized nodes in the Field of Interest FoI may get depleted over the time. The nodes get drained, decreasing the sensing radius of the sensors, resulting in the decrease in the network coverage, as a result decrease in Quality of Coverage QoC. A redeployment of sensors leading to an improvement in the coverage is of significant use in practical real life applications. Second, sensor nodes with varying sensing characteristics are often desirable, especially when only a subset of deployed sensors may be mobile. It is show that the generalized version of UREA presented here lead to significant improvement in the coverage. In each case, we present findings from a study of large scale deployment involving ten sets of random deployments over 40to 100 nodes. To the best of our knowledge, this work is the first to study, model simulate the intermediate non-deterministic post deployment scenario and non-deterministic nonhomogeneous sensor node deployments to improve the network coverage

Design of multiloop controllers for an ammonia reactor

The specific objective of this paper is to develop multiloop controllers that would achieve asymptotic regulation in the presence of parameter variations and disturbance inputs for a tubular reactor used in ammonia synthesis. The dynamic model considered here has nine state variables, two control inputs, and two outputs. A systematic procedure for pairing the two inputs with the corresponding two outputs is presented. The two multiloop proportional controllers so configured are designed via the parameter plane method. This economic configuration of controllers maintains the temperature profile almost at the optimal value whereas the point controllers fail to do so